A Novel Trilateral Filter based Adaptive Support Weight Method for Stereo Matching

نویسندگان

  • Dongming Chen
  • Mohsen Ardabilian
  • Liming Chen
چکیده

The performance of local stereo matching algorithm highly depends on the support window selected, in which the cost are aggregated. A variety of cost aggregation approaches (proposed before 2008) were comprehensively analyzed in [7] and these approaches attempt to seek an optimal support window for each pixel by changing the window size, shape and center offset. The ideal optimal window should satisfy the rule that all pixels in this window lie on the same disparity with the center pixel. Recent years have witnessed a great deal of attention focused on the Adaptive Support Weight (ASW) based methods [1, 4, 6, 8], proposed firstly by Yoon and Kweon in [8]. The ASW methods assign an adaptive weight to each pixel of the support window, depending on how it is likely to lie on the same disparity with the center pixel. Essentially, the assignment of an adaptive weight amounts to changing the support window in terms of size, shape or center offset. In ASW methods, the weight function is very important, because it directly decides the support window. The weight function proposed in [8] is based on bilateral filter. Following this pioneering work, various weight function were proposed, including in particular the segmented bilateral filter weight function [6], the geodesic weight function [1], the guided filter weight function [4]. Thus, which weight function is the most accurate one? Recently, Hosni et al. [2] carried out a comprehensive comparative study to fairly evaluate various weight functions while fixing the preprocessing, matching cost function and post-processing. Their conclusion is that both bilateral filter weight function [8] and guided filter weight function [4] are the best, since bilateral filter weight function performs better on the average rank while guided filter weight function produces a lower average error. We revisit the bilateral filter weight function [8], which obeys two rules that, given a support pixel, (1) if its color is similar to the center pixel’s and (2) if it is spatially close to the center pixel, it is likely to lie on the same disparity with the center pixel. Therefore, the bilateral filter weight function consists of two parts, color similarity term and spatial proximity term, defined as:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stereo Matching by Filtering-Based Disparity Propagation

Stereo matching is essential and fundamental in computer vision tasks. In this paper, a novel stereo matching algorithm based on disparity propagation using edge-aware filtering is proposed. By extracting disparity subsets for reliable points and customizing the cost volume, the initial disparity map is refined through filtering-based disparity propagation. Then, an edge-aware filter with low c...

متن کامل

A New Modified Particle Filter With Application in Target Tracking

The particle filter (PF) is a novel technique that has sufficiently good estimation results for the nonlinear/non-Gaussian systems. However, PF is inconsistent that caused mainly by loss of particle diversity in resampling step and unknown a priori knowledge of the noise statistics. This paper introduces a new modified particle filter called adaptive unscented particle filter (AUPF) to overcome th...

متن کامل

A Local Iterative Refinement Method for Adaptive Support-Weight Stereo Matching

A new stereo matching algorithm is introduced that performs iterative refinement on the results of adaptive support-weight stereo matching. During each iteration of disparity refinement, adaptive support-weights are used by the algorithm to penalize disparity differences within local windows. Analytical results show that the addition of iterative refinement to adaptive support-weight stereo mat...

متن کامل

A Survey on Stereo Matching Techniques for 3D Vision in Image Processing

Extraction of three-dimensional scene from the stereo images is the most effective research area in the field of computer vision. Stereo vision constructs the actual three-dimensional scene from two stereo images having different viewpoints. Stereo matching is a correspondence problem, that means it ascertains which part of image corresponds to which part of another image ,where variations insi...

متن کامل

Stereo Matching Algorithm Based on a Generalized Bilateral Filter Model

Stereo matching is a kernel problem in stereo vision systems. Stereo algorithms can be roughly classified into local and global approaches. Local algorithms use Winner-Take-All strategy, simply taking disparity level that minimizes the aggregation costs. In this paper we present a local stereo matching algorithm with an adaptive cost aggregation strategy based on a generalized bilateral filter ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013